Bumps [wasmtime](https://github.com/bytecodealliance/wasmtime) from 40.0.3 to 40.0.4.
- [Release notes](https://github.com/bytecodealliance/wasmtime/releases)
- [Changelog](https://github.com/bytecodealliance/wasmtime/blob/v40.0.4/RELEASES.md)
- [Commits](bytecodealliance/wasmtime@v40.0.3...v40.0.4)

---
updated-dependencies:
- dependency-name: wasmtime
  dependency-version: 40.0.4
  dependency-type: indirect
...

Signed-off-by: dependabot[bot] <support@github.com>
Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>

)

Given a set of rules parse it and walk the AST to find identifiers and generate an ASCII tree that show the modules and other rules that each rule depends on.

By default it generates a graph of all the rules, but you can select any number of rules with the -r argument.

For example, given these rules:

```
rule a { condition: pe.is_dll() }
rule b { condition: a }
rule c { condition: b }
rule d { condition: false }
```

And selecting using `-r b` you get output that looks like this:

```
 a
└─ mod: pe

 b
└─ a
       └─ mod: pe

 c
└─ b
        └─ a
                └─ mod: pe

 d
```

---------

Co-authored-by: Victor M. Alvarez <vmalvarez@virustotal.com>